Godel, Turing, and K-graph machines
نویسنده
چکیده
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملMathematical Structures of Complexity
This article discusses a variety of mathematically-inspired approaches to the study of complexity and their application to the study and understanding of complex systems. These approaches have their origin in the study of limitative results in logic, mathematical linguistics, and the theory of computation, based upon the work of Godel, Turing, Chomsky, and Kolmogorov, among many others. The top...
متن کاملGraph Turing Machines
We consider graph Turing machines, a model of parallel computation on a graph, which provides a natural generalization of several standard computational models, including ordinary Turing machines and cellular automata. In this extended abstract, we give bounds on the computational strength of functions that graph Turing machines can compute. We also begin the study of the relationship between t...
متن کاملPhilosophical Solution to P=?NP: P is Equal to NP
The P=?NP problem is philosophically solved by showing P is equal to NP in the random access with unit multiply (MRAM) model. It is shown that the MRAM model empirically best models computation hardness. The P=?NP problem is shown to be a scientific rather than a mathematical problem. The assumptions involved in the current definition of the P?=NP problem as a problem involving non deterministi...
متن کاملInteractive Foundations of Computing
The claim that interactive systems have richer behavior than algorithms is surprisingly easy to prove: Turing machines cannot model interaction machines because: interaction is not expressible by a finite initial input string. Interaction machines extend the Chomsky hierarchy, are modeled by interaction grammars, and precisely capture fuzzy concepts like open systems and empirical computer scie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015